The set of second iterates is nowhere dense in $C$

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Models in which every nonmeager set is nonmeager in a nowhere dense Cantor set

We prove that it is relatively consistent with ZFC that in any perfect Polish space, for every nonmeager set A there exists a nowhere dense Cantor set C such that A∩C is nonmeager in C. We also examine variants of this result and establish a measure theoretic analog.

متن کامل

On nowhere dense graphs

A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special cl...

متن کامل

Characterisations of Nowhere Dense Graphs

Nowhere dense classes of graphs were introduced by Nešetřil and Ossona de Mendez as a model for “sparsity” in graphs. It turns out that nowhere dense classes of graphs can be characterised in many different ways and have been shown to be equivalent to other concepts studied in areas such as (finite) model theory. Therefore, the concept of nowhere density seems to capture a natural property of g...

متن کامل

The number of translates of a closed nowhere dense set required to cover a Polish group

For a Polish group G let covG be the minimal number of translates of a fixed closed nowhere dense subset of G required to cover G. For many locally compact G this cardinal is known to be consistently larger than cov(M) which is the smallest cardinality of a covering of the real line by meagre sets. It is shown that for several non-locally compact groups covG = cov(M). For example the equality h...

متن کامل

Directed nowhere dense classes of graphs

Many natural computational problems on graphs such as finding dominating or independent sets of a certain size are well known to be intractable, both in the classical sense as well as in the framework of parameterized complexity. Much work therefore has focussed on exhibiting restricted classes of graphs on which these problems become tractable. While in the case of undirected graphs, there is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1991

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1991-1033961-5